Solving Bus Terminal Location Problem Using Simulated Annealing Method
نویسنده
چکیده مقاله:
Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. In this research, different techniques for solving the problem are investigated to choose the best one. One of these methods is Simulated Annealing (SA), which is an efficient algorithm for solving complex optimization problems. SA’s parameters vary from one problem to another. Here, for the bus terminal location problem, SA’s parameters are determined, then the problem is solved. Another algorithm is the Implicit Enumeration method. In this paper, the results obtained from the above 3 techniques are compared. The criteria for this comparison are the CPU time and the accuracy of the solution. In all the cases studied, SA gave the most accurate results. Its CPU time is lower than the others, too. Solving the bus terminal location problem for the Mashhad network shows that SA is about 150 times faster than GAMS and 50 times faster than Implicit Enumeration. Moreover, bus terminal location problem for the network of the city of Tehran, which is a more difficult problem, has been solved by the SA algorithm successfully. Keywords: Bus network, Lacation problem, Heuristic, Simulated Annealing, Implicit Enumeration
منابع مشابه
On solving complex multi-period location models using simulated annealing
This paper describes a study aimed at evaluating the capabilities of simulated annealing in dealing with complex, real-world multi-period location problems raised by school network planning in Portugal. The problems were formulated as mixed-integer linear optimization models. The models allow for facility closure or size reduction besides facility opening and size expansion, with sizes possibly...
متن کاملSolving bus terminal location problems using evolutionary algorithms
Bus terminal assignment with the objective of maximizing public transportation service is known as bus terminal location problem (BTLP). We formulate the BTLP, a problem of concern in transportation industry, as a p-uncapacitated facility location problem (p-UFLP) with distance constraint. The p-UFLP being NP-hard (Krarup and Pruzan, 1990), we propose evolutionary algorithms for its solution. A...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملSolving the Assignment Problem using Genetic Algorithm and Simulated Annealing
The paper attempts to solve the generalized “Assignment problem” through genetic algorithm and simulated annealing. The generalized assignment problem is basically the “N menN jobs” problem where a single job can be assigned to only one person in such a way that the overall cost of assignment is minimized. While solving this problem through genetic algorithm (GA), a unique encoding scheme is us...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 20 شماره 2
صفحات 125- 140
تاریخ انتشار 2001-04
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023